On inferring linear single-tree languages
نویسنده
چکیده
We consider the inferability of linear single-tree languages. We are able to show that if the terminal productions of the corresponding grammars obey a simple restriction , then the languages generated are inferable from positive samples only. Moreover, we solve an open problem posed by Greibach, Shi, and Simonson concerning the unambiguity of certain ultralinear STG's.
منابع مشابه
Inferring Strings from Suffix Trees and Links on a Binary Alphabet
A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval. In this paper we consider the reverse engineering problem on suffix trees: Given an unlabeled ordered rooted tree T accompanied with a node-to-node transition function f , infer a string whose suffix tree and its suffix links fo...
متن کاملString Inference from the LCP Array
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the LCPs for lexicographically adjacent suffixes of a string. Together the two arrays are roughly equivalent to the suffix tree with the LCP array representing the tree shape. In order to better understand the combinat...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملInferring a Tree from Walks
A walk in an undirected edge-colored graph G is a path containing all edges of G. The tree inference from a walk is, given a string x of colors, finding the smallest tree that realizes a walk whose sequence of edge-colors coincides with x. We prove that the problem is solvable in O(n) time, where n is the length of a given string, We furthermore consider the problem of inferring a tree from a f...
متن کاملOn inferring zero-reversible languages
We use a language-theoretic result for zero-reversible languages to show that there exists a linear time inference method for this class of languages using positive d a t a only.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 73 شماره
صفحات -
تاریخ انتشار 2000